Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding
نویسنده
چکیده
This report is a summary of the issue of separation and code design for network data transmission environments, as discussed in the paper by Effros et al. [1]. It is often considered that the failure of source-channel separation in network environments is a crucial obstacle in applying information theoretic tools in networks. However, with a consistent framework for digital networks, the source-channel separation turns out to be more robust than existing counterexamples may suggest. More interestingly, the separation of source and channel code design does not necessarily simplify the design of communication systems for digital networks; rather such decomposition of a problem into modular tasks may increase complexity as the decomposition imposes unnecessary conditions. The network coding literature assumes independent data bits and lossless links, hence endorses a philosophy where source and channel coding are separated from network coding or routing. However, there are simple examples showing neither separate source-network coding nor separate channel-network coding techniques guarantee optimal performance. We further argue that the major challenge in design of network systems is the lack of separation of large networks into canonical elements such as simple multiple access or broadcast networks, rather than the lack of source-channel separation in networks.
منابع مشابه
Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding
We examine the issue of separation and code design for network data transmission environments. We demonstrate that source-channel separation holds for several canonical network channel models when the whole network operates over a common finite field. Our approach uses linear codes. This simple, unifying framework allows us to re-establish with economy the optimality of linear codes for single ...
متن کاملNested linear/Lattice codes for structured multiterminal binning
Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning scheme. Wyner and other researchers proposed various forms of coset codes for efficient binning, yet ...
متن کاملNonbinary Coding: Towards a Unified Framework Across Multiple Layers
In addition to the invention of iterative decoded capacity-achieving channel coding schemes, namely, turbo codes in the early 1990’s and the rediscovery of low-density parity-check (LDPC) codes in the mid 1990’s, digital fountain codes and network coding are two recent breakthroughs in the coding community. They offer great promise for providing robust and efficient data transport through a lar...
متن کاملERROR CONTROLS FOR BROADCAST COMMUNICATION SYSTEMS: AN INTEGER PROGRAMMING APPROACH TO UEP CODING SCHEME AND A DETERMINISTIC APPROACH TO NETWORK CODING by
ERROR CONTROLS FOR BROADCAST COMMUNICATION SYSTEMS: AN INTEGER PROGRAMMING APPROACH TO UEP CODING SCHEME AND A DETERMINISTIC APPROACH TO NETWORK CODING Wook Jung, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Traditional network protocols employ error control techniques for reliable information dissemination over noisy communication channels. In this dissertation,...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003